منابع مشابه
Banting Lecture 2012
The Banting Medal for Scientific Achievement Award is the American Diabetes Association's highest scientific award and honors an individual who has made significant, long-term contributions to the understanding of diabetes, its treatment, and/or prevention.The award is named after Nobel Prize winner Sir Frederick Banting, who codiscovered insulin treatment for diabetes. Bruce M. Spiegelman, PhD...
متن کاملLecture 3 — February 23 , 2012
Planar point location is a problem in which we are given a planar graph (with no crossings) defining a map, such as the boundary of GUI elements. Then we wish to support a query that takes a point given by its coordinates (x, y) and returns the face that contains it (see Figure 1 for an example). As is often the case with these problems, there is both a static and dynamic version of this proble...
متن کاملLecture 6 — March 6 , 2012
In the last lecture we discussed representing executions of binary search trees as point sets. A BST execution is represented as the point set of all nodes touched during the execution of the algorithm. A point set represents a valid BST execution if and only if it is arborally satistified. A point set is arborally satisfied iff any rectange spanned by two points not on a horizonal or vertical ...
متن کاملLecture 15 — April 12 , 2012
In this lecture, we look at various data structures to solve problems about static trees: given a static tree, we perform some preprocessing to construct our data structure, then use the data structure to answer queries about the tree. The three problems we look at in this lecture are range minimum queries (RMQ), lowest common ancestors (LCA), and level ancestor (LA); we will support all these ...
متن کاملLecture 5 — March 1 , 2012
In the next two lectures we study the question of dynamic optimality, or whether there exists a binary search tree algorithm that performs ”as well” as all other algorithms on any input string. In this lecture we will define a binary search tree as a formal model of computation, show some analytic bounds that a dynamically optimal binary search tree needs to satisfy, and show two search trees t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Youth and Adolescence
سال: 2013
ISSN: 0047-2891,1573-6601
DOI: 10.1007/s10964-013-0025-3